A tabu search based approach for graph layout
نویسندگان
چکیده
منابع مشابه
A Tabu Search Based Approach for Graph Layout
This paper describes an automated tabu search based method for drawing general simple graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of metrics which are used in a weighted fitness function to measure the aesthetic quality of the graph layou...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملA Tabu Search Approach for Graph- Structured Case Retrieval
In case-based reasoning (CBR), graph-structured representations are desirable for complex application domains such as planning and design. Graph is a powerful data structure and allows knowledge to be encoded completely and expressively. However, the advantages come with a computational overhead for case retrieval, which presently prevents the usage of graph-structured representation for large-...
متن کاملSolving Facility Layout Problem: Three-level Tabu Search Metaheuristic Approach
In this paper an improved tabu search (ITS) based approach is proposed for solving facility layout problem (FLP) which is formulated as quadratic assignment problem (QAP). ITS is an improved version of conventional tabu search technique which incorporates three levels viz. intensification, reconstruction, and solution acceptance. To evaluate the efficacy of the proposed ITS, it is tested for be...
متن کاملAn effective multilevel tabu search approach for balanced graph partitioning
Graph partitioning is one of the fundamental NP-complete problems which is widely applied in many domains, such as VLSI design, image segmentation, data mining etc. Given a graph G = (V,E), the balanced k-partitioning problem consists in partitioning the vertex set V into k disjoint subsets of about the same size, such that the number of cutting edges is minimized. In this paper, we present a m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visual Languages & Computing
سال: 2014
ISSN: 1045-926X
DOI: 10.1016/j.jvlc.2014.10.019